Computation tree

Results: 129



#Item
51Almost all decision trees do not allow significant quantum speed-up

Almost all decision trees do not allow significant quantum speed-up

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2012-12-14 16:07:15
52Automatic construction of parse trees for lexemes ∗ Danny Dub´e Anass Kadiri  Universit´e Laval

Automatic construction of parse trees for lexemes ∗ Danny Dub´e Anass Kadiri Universit´e Laval

Add to Reading List

Source URL: www.schemeworkshop.org

Language: English - Date: 2011-08-12 16:48:41
53A Foundation for Flow-Based Program Matching Using Temporal Logic and Model Checking Julien Brunel Damien Doligez

A Foundation for Flow-Based Program Matching Using Temporal Logic and Model Checking Julien Brunel Damien Doligez

Add to Reading List

Source URL: pagesperso-systeme.lip6.fr

Language: English - Date: 2011-12-17 11:26:12
54Reasoning about XML with Temporal Logics and Automata Leonid Libkin Cristina Sirangelo  University of Edinburgh

Reasoning about XML with Temporal Logics and Automata Leonid Libkin Cristina Sirangelo University of Edinburgh

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2009-09-16 09:06:42
55A Course in Machine Learning Hal Daumé III  10 | L EARNING T HEORY

A Course in Machine Learning Hal Daumé III 10 | L EARNING T HEORY

Add to Reading List

Source URL: ciml.info

Language: English - Date: 2014-09-24 16:08:31
56The tree machine? Arnaud Spiwack MINES ParisTech   Abstract. A variant of Turing machines is introduced where the tape

The tree machine? Arnaud Spiwack MINES ParisTech Abstract. A variant of Turing machines is introduced where the tape

Add to Reading List

Source URL: www.cri.ensmp.fr

Language: English - Date: 2015-02-19 09:03:36
57Polynomial irreducibility testing through Minkowski summand computation Deepanjan Kesh and Shashank K Mehta∗ Abstract In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomial

Polynomial irreducibility testing through Minkowski summand computation Deepanjan Kesh and Shashank K Mehta∗ Abstract In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomial

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 23:59:42
58Theoretical Computer Science – 366 www.elsevier.com/locate/tcs Adapting innocent game models for the B#ohm tree -theory Andrew D. Ker, Hanno Nickau∗ , C.-H. Luke Ong

Theoretical Computer Science – 366 www.elsevier.com/locate/tcs Adapting innocent game models for the B#ohm tree -theory Andrew D. Ker, Hanno Nickau∗ , C.-H. Luke Ong

Add to Reading List

Source URL: www.cs.ox.ac.uk

Language: English - Date: 2006-08-03 11:40:10
59Subtree and Tree Pattern Pushdown Automata for Trees In Prefix Notation

Subtree and Tree Pattern Pushdown Automata for Trees In Prefix Notation

Add to Reading List

Source URL: www.dcs.kcl.ac.uk

Language: English - Date: 2009-02-16 12:13:50
60SCORAM: Oblivious RAM for Secure Computation  ∗ Xiao Shaun Wang

SCORAM: Oblivious RAM for Secure Computation ∗ Xiao Shaun Wang

Add to Reading List

Source URL: i.cs.hku.hk

Language: English - Date: 2014-09-26 10:55:17